Polynomial-time computation via local inference relations
نویسندگان
چکیده
منابع مشابه
Finding Relations in Polynomial Time
Given a set of m observations on n variables, an 0(mn) algorithm is proposed to find a basis of all affine relations between these variables satisfied by the observations. On a 25 variables example, this new algorithm is 130 000 times faster than the "all subsets" option for linear regression of the SAS package which is a non polynomial alternative. Extension to the cases where squares, ratios,...
متن کاملFast Computation of Auxiliary Quantitiesin Local Polynomial
We investigate the extension of binning methodology to fast computation of several auxiliary quantities that arise in local polynomial smoothing. Examples include degrees of freedom measures, cross-validation functions, variance estimates and exact measures of error. It is shown that the computational eeort required for such approximations is of the same order of magnitude as that required for ...
متن کاملNew Results on Local Inference Relations
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom up evaluation terminates in polynomial time. The local rule set transformation gives polynomial time evaluation strategies for a large variety of rule sets that can not be given terminating evaluation strategies by any other known automatic technique. Thi...
متن کاملOn One-One Polynomial Time Equivalence Relations
Two sets A and B are one-one polynomial time equivalent (one-one p-equivalent) if there are polynomial time one-one reductions from A to B and from B to A. In this paper we show that all EXPTIME complete sets are one-one p-equivalent by length increasing reductions. Moreover we show this result for many complexity classes which can be proved by a straightforward diagonalization to contain P pro...
متن کاملLinear, Polynomial or Exponential? Complexity Inference in Polynomial Time
We present a new method for inferring complexity properties for imperative programs with bounded loops. The properties handled are: polynomial (or linear) boundedness of computed values, as a function of the input; and similarly for the running time. It is well known that complexity properties are undecidable for a Turing-complete programming language. Much work in program analysis overcomes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2002
ISSN: 1529-3785,1557-945X
DOI: 10.1145/566385.566387